ENUMERATION PROBLEMS FOR A LINEAR CONGRUENCE EQUATION
نویسندگان
چکیده
منابع مشابه
Enumeration Problems for a Linear Congruence Equation
Let m ≥ 2 and r ≥ 1 be integers and let c ∈ Zm = {0, 1, . . . , m− 1}. In this paper, we give an upper bound and a lower bound for the number of unordered solutions x1, . . . , xn ∈ Zm of the congruence x1 + x2 + · · · + xr ≡ c mod m. Exact formulae are also given when m or r is prime. This solution number involves the Catalan number or generalized Catalan number in some special cases. Moreover...
متن کاملA generalized implicit enumeration algorithm for a class of integer nonlinear programming problems
Presented here is a generalization of the implicit enumeration algorithm that can be applied when the objec-tive function is being maximized and can be rewritten as the difference of two non-decreasing functions. Also developed is a computational algorithm, named linear speedup, to use whatever explicit linear constraints are present to speedup the search for a solution. The method is easy to u...
متن کاملA goal programming approach for fuzzy flexible linear programming problems
We are concerned with solving Fuzzy Flexible Linear Programming (FFLP) problems. Even though, this model is very practical and is useful for many applications, but there are only a few methods for its situation. In most approaches proposed in the literature, the solution process needs at least, two phases where each phase needs to solve a linear programming problem. Here, we propose a method t...
متن کاملQuadratic and Linear Congruence*
The number of simultaneous solutions of a quadratic and a linear congruence does not seem to be discussed in the literature, yet a knowledge of the invariants necessary to specify this number should lead to an arithmetical classification of the form-pairs involved. This preliminary investigation is confined to congruences with modulus odd and prime to the g.c.d.'s of the two sets of coefficient...
متن کاملa generalized implicit enumeration algorithm for a class of integer nonlinear programming problems
presented here is a generalization of the implicit enumeration algorithm that can be applied when the objec-tive function is being maximized and can be rewritten as the difference of two non-decreasing functions. also developed is a computational algorithm, named linear speedup, to use whatever explicit linear constraints are present to speedup the search for a solution. the method is easy to u...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Taiwanese Journal of Mathematics
سال: 2014
ISSN: 1027-5487
DOI: 10.11650/tjm.18.2014.2295